Modeling and Solving the Open-End Bin Packing Problem
نویسندگان
چکیده
منابع مشابه
The Ordered Open-End Bin-Packing Problem
We study a variant of the classical bin-packing problem, the ordered open-end bin-packing problem, where first a bin can be filled to a level above 1 as long as the removal of the last piece brings the bin’s level back to below 1 and second, the last piece is the largest-indexed piece among all pieces in the bin. We conduct both worst-case and average-case analyses for the problem. In the worst...
متن کاملSolving the variable size bin packing problem with discretized formulations
In this paper we study the Variable Size Bin Packing Problem (VSBPP) which is a generalization of the Bin Packing Problem where bins of different capacities (and different costs) are available for packing a set of items. The objective is to pack all the items minimizing the total cost associated with the bins. We discuss applications of the VSBPP and propose and discuss one generic (non-linear ...
متن کاملA Novel GRASP Algorithm for Solving the Bin Packing Problem
The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. This problem consists in packing a set of items into a minimum number of bins. There are several variants of this problem; the most basic problem is the onedimensional bin packing problem (1-BPP). In this paper, we present a new approach based on the GRASP procedure to deal with the1-BPP problem. The fir...
متن کاملHeuristics for Solving the Bin-Packing Problem with Conflicts
This paper deals to solve the one dimensional bin-packing problem with conflicts. The conflicts are represented by a graph whose nodes are the items, and adjacent items cannot be packed into the same bin. We propose an adaptation of Minimum Bin Slack heuristic also with a combination of heuristics based on the uses of the classical bin-packing methods to packing items of maximal-stable-subsets ...
متن کاملAn Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be exceeded by the last item packed into the bin. We present a branch-and-price algorithm for its exact optimization. The pricing subproblem is a special variant of the binary knapsack problem, in which the items are ordere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2016
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2016.071252